An Ant Colony based Hyper-Heuristic Approach for the Set Covering Problem
نویسندگان
چکیده
منابع مشابه
A Local Branching Approach for the Set Covering Problem
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...
متن کاملA general purpose Hyper – Heuristic based on Ant colony optimization
In the plan of the CHESC2001 competition [1], an hyper heuristic has been designed based on the Ant Colony Optimization method (from now ACO). According to the competition goals, the algorithm was developed with the intention to produce an independent model of the problem domain and the particular instance to be solved. This means that the hyper-heuristic is abstracted from the features of each...
متن کاملAn effective and simple heuristic for the set covering problem
This paper investigates the development of an effective heuristic to solve the set covering problem (SCP) by applying the meta-heuristic Meta-RaPS (Meta-heuristic for Randomized Priority Search). In Meta-RaPS, a feasible solution is generated by introducing random factors into a construction method. Then the feasible solutions can be improved by an improvement heuristic. In addition to applying...
متن کاملAn Iterated Heuristic Algorithm for the Set Covering Problem
The set covering problem is a well-known NP-hard combinatorial optimization problem with wide practical applications. This paper introduces a novel heuristic for the uni-cost set covering problem. An iterated approximation algorithm (ITEG) based on this heuristic is developed: in the rst iteration a cover is constructed, and in the next iterations a new cover is built by starting with part of t...
متن کاملAn Iterated Heuristic Algorithm for the Set Covering Problem 32
The set covering problem is a well-known NP-hard combinatorial optimization problem with wide practical applications. This paper introduces a novel heuristic for the uni-cost set covering problem. An iterated approximation algorithm (ITEG) based on this heuristic is developed: in the rst iteration a cover is constructed, and in the next iterations a new cover is built by starting with part of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ADCAIJ: Advances in Distributed Computing and Artificial Intelligence Journal
سال: 2015
ISSN: 2255-2863
DOI: 10.14201/adcaij201541121